SEMIGROUPS GENERATED BY PARTITIONS
نویسندگان
چکیده
منابع مشابه
Numerical Semigroups Generated by Intervals
We study numerical semigroups generated by intervals and solve the following problems related to such semigroups: the membership problem, give an explicit formula for the Frobe-nius number, decide whether the semigroup is a complete intersection and/or symmetric, and computation of the cardi-nality of a (any) minimal presentation of this kind of numerical semigroups. A numerical semigroup is a ...
متن کاملGroups and Semigroups Generated by Automata
In this dissertation we classify the metabelian groups arising from a restricted class of invertible synchronous automata over a binary alphabet. We give faithful, self-similar actions of Heisenberg groups and upper triangular matrix groups. We introduce a new class of semigroups given by a restricted class of asynchronous automata. We call these semigroups " expanding automaton semigroups ". W...
متن کاملAsymptotics of Semigroups Generated by Operator Matrices
We survey some known results about generator property of operator matrices with diagonal or coupled domain. Further, we use basic properties of the convolution of operator-valued mappings in order to obtain stability results for such semigroups. 1. Operator matrices with diagonal domain While tackling abstract problems that are related to concrete initial–boundary value problems with dynamical ...
متن کاملSimply Generated Non-Crossing Partitions
We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing partitions with constraints on their block sizes. Our main tool is a bijection between non-crossing partitions and plane trees, which maps such simply generated non-c...
متن کاملOn Triply-generated Telescopic Semigroups and Chains of Semigroups
Given a numerical semigroup S = 〈a1, a2, . . . , aν〉 in canonical form, let M(S) := S \ {0}. Define associated numerical semigroups B(S) := {x ∈ N0 : x + M(S) ⊆ M(S)} and L(S) := 〈a1, a2 − a1, . . . , aν − a1〉 . Set B0(S) = S, and for i ≥ 1, define Bi(S) := B(Bi−1(S)). Similarly, set L0(S) = S, and for i ≥ 1, define Li(S) := L(Li−1(S)). These constructions define finite ascending chains of semi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Electronic Journal of Algebra
سال: 2019
ISSN: 1306-6048
DOI: 10.24330/ieja.587041